例句與造句

1. Every planar graph has a flat and linkless embedding : simply embed the graph into a plane and embed the plane into space.
2. An embedding of a graph into three-dimensional space in which no two of the cycles are topologically linked is called a linkless embedding.
3. A graph has a linkless embedding if and only if it does not have one of the seven graphs of the Petersen family as a minor.
4. Their algorithm finds large planar subgraphs within the given graph such that, if a linkless embedding exists, it has to respect the planar embedding of the subgraph.
5. Related to the concept of linkless embedding is the concept of knotless embedding, an embedding of a graph in such a way that none of its simple cycles form a nontrivial knot.
6. It's difficult to find linkless embedding in a sentence. 用linkless embedding造句挺難的
7. raised the question of whether every graph with a linkless embedding in three-dimensional Euclidean space has a linkless embedding in which all edges are represented by straight line segments, analogously to F醨y's theorem for two-dimensional embeddings.
8. raised the question of whether every graph with a linkless embedding in three-dimensional Euclidean space has a linkless embedding in which all edges are represented by straight line segments, analogously to F醨y's theorem for two-dimensional embeddings.
9. One may also define graph families by the presence or absence of more complex knots and links in their embeddings, or by linkless embedding in three-dimensional manifolds other than Euclidean space . define a graph embedding to be triple linked if there are three cycles no one of which can be separated from the other two; they show that " K " 9 is not intrinsically triple linked, but " K " 10 is.